Circular support in random sorting networks
نویسندگان
چکیده
منابع مشابه
Random Sorting Networks
A sorting network is a shortest path from 12 · · · n to n · · · 21 in the Cayley graph of Sn generated by nearest-neighbour swaps. We prove that for a uniform random sorting network, as n → ∞ the spacetime process of swaps converges to the product of semicircle law and Lebesgue measure. We conjecture that the trajectories of individual particles converge to random sine curves, while the permuta...
متن کاملRandom Subnetworks of Random Sorting Networks
A sorting network is a shortest path from 12 · · · n to n · · · 21 in the Cayley graph of Sn generated by nearest-neighbor swaps. For m ≤ n, consider the random m-particle sorting network obtained by choosing an n-particle sorting network uniformly at random and then observing only the relative order of m particles chosen uniformly at random. We prove that the expected number of swaps in locati...
متن کاملA pattern theorem for random sorting networks
A sorting network is a shortest path from 12 · · ·n to n · · · 21 in the Cayley graph of the symmetric group Sn generated by nearest-neighbor swaps. A pattern is a sequence of swaps that forms an initial segment of some sorting network. We prove that in a uniformly random n-element sorting network, any fixed pattern occurs in at least cn disjoint space-time locations, with probability tending t...
متن کاملThe circular topology of rhythm in asynchronous random Boolean networks.
The analysis of previously evolved rhythmic asynchronous random Boolean networks [Biosystems 59 (2001) 185] reveals common topological characteristics indicating that rhythm originates from a circular functional structure. The rhythm generating core of the network has the form of a closed ring which operates as a synchronisation substrate by supporting a travelling wave of state change; the siz...
متن کاملDeterministic Sorting on Circular Arrays
We analyze the sorting problem on circular processor arrays with bidirectional connections. We assume that initially each PU holds k 1 packets. On linear processor arrays the sorting problem can easily be solved for any k by using odd-even transposition sort, but for the circular array it is not obvious how to exploit the wrap-around connection. The easier routing problem on circular processor ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the American Mathematical Society
سال: 2019
ISSN: 0002-9947,1088-6850
DOI: 10.1090/tran/7819